Oracle Turing machines faced with the verification problem

The main current issue about hypercomputation concern the following thesis: it is physically possible to build a hypercomputation model. To prove this thesis, one possible strategy could be to physically build an oracle Turing machine. More precisely, it is about finding a physical theory where a hypercomputation model will be able to use some external information from nature. Such an information could be regarded as an oracle that provide an additional element in order to go beyond Turing machines limits. However, there is a recurring epistemological problem about the physical construction of an oracle Turing machine. This problem called “verification problem” may be worded as follows: if we assume we have such a hypercomputation model physically built, it would be impossible to verify that this model is able to compute a non Turing-computable function. In this paper I will propose an analysis of the verification problem in order to show that it does not explicitly dispute the strategy about a physical construction of an oracle Turing machine.